A Method for Classification of Doubly Resolvable Designs and Its Application
نویسنده
چکیده
The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property—they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications. Therefore the classification of doubly resolvable designs and their sets of mutually orthogonal resolutions might be very important. We develop a method for classification of doubly resolvable designs. Using this method and extending it with some theoretical restrictions we succeed in obtaining a classification of doubly resolvable designs with small parameters. Also we classify 1-parallelisms and 2-parallelisms of PG(5, 2) with automorphisms of order 31 and find the first known transitive 2-parallelisms among them. The content of the paper comprises the essentials of the author’s Ph.D. thesis. ACM Computing Classification System (1998): G.2.1.
منابع مشابه
Doubly resolvable designs with small parameters
Doubly resolvable 2-(v,k,λ) designs (DRDs) with small parameters and their resolutions which have orthogonal resolutions (RORs) are constructed and classified up to isomorphism. Exact values or lower bounds on the number of the nonisomorphic sets of m mutually orthogonal resolutions (m-MORs) are presented. The implemented algorithms and the parameter range of this method are discussed, and the ...
متن کاملExistence of doubly near resolvable (v, 4, 3) BIBDs
The existence of doubly near resolvable (v, 2, 1)-BIBDs was established by Mullin and Wallis in 1975. For doubly near resolvable (v, 3, 2)-BIBDs, the existence problem was investigated by Lamken in 1994, and completed by Abel, Lamken and Wang in 2007. In this paper, we look at doubly near resolvable (v, 4, 3)-BIBDs; we establish that these exist whenever v ≡ 1 (mod 4) except for v = 9 and possi...
متن کاملOn the Classification of Resolvable 2-(12, 6, 5c) Designs
In this paper we describe a backtrack search over parallel classes with a partial isomorph rejection to classify resolvable 2-(12, 6, 5c) designs. We use the intersection pattern between the parallel classes and the fact that any resolvable 2-(12, 6, 5c) design is also a resolvable 3-(12, 6, 2c) design to effectively guide the search. The method was able to enumerate all nonsimple resolutions a...
متن کاملThe Existence of Kirkman Squares-Doubly Resolvable (v, 3, 1)-BIBDs
A Kirkman square with index λ, latinicity μ, block size k, and v points, KSk(v; μ, λ), is a t × t array (t = λ(v − 1)/μ(k − 1)) defined on a v-set V such that (1) every point of V is contained in precisely μ cells of each row and column, (2) each cell of the array is either empty or contains a k-subset of V , and (3) the collection of blocks obtained from the non-empty cells of the array is a (...
متن کاملOn an Algorithm for a Double-resolvability Test
To find all doubly resolvable designs with definite parameters, we construct the design resolutions in lexicographic order point by point. To partial solutions with more than 2/3 of the points we apply a double-resolvability test, namely we try to construct an orthogonal resolution. The test reduces significantly the number of partial solutions, and is very important for the efficiency of the w...
متن کامل